On Isodual Cyclic Codes over Finite Fields and Finite Chain Rings: Monomial Equivalence
نویسندگان
چکیده
This paper present the construction cyclic isodual codes over finite fields and finite chain rings. These codes are monomially equivalent to their dual. Conditions are given for the existence of cyclic isodual codes. In addition, the concept of duadic codes over finite fields is extended to finite chain rings. Several constructions of isodual cyclic codes and self-dual codes are given.
منابع مشابه
Equivalence of Quasi-cyclic Codes over Finite Fields
This paper considers the equivalence problem for quasi-cyclic codes over finite fields. The results obtained are used to construct isodual quasi-cyclic codes.
متن کاملCharacteristics of invariant weights related to code equivalence over rings
The Equivalence Theorem states that, for a given weight on the alphabet, every linear isometry between linear codes extends to a monomial transformation of the entire space. This theorem has been proved for several weights and alphabets, including the original MacWilliams’ Equivalence Theorem for the Hamming weight on codes over finite fields. The question remains: What conditions must a weight...
متن کاملThe Gray Image of Codes over Finite Chain Rings
The results of J. F. Qian et al. [5] on (1 − γ)-constacyclic codes over finite chain rings of nilpotency index 2 are extended to (1 − γe)constacyclic codes over finite chain rings of arbitrary nilpotency index e+1. The Gray map is introduced for this type of rings. We prove that the Gray image of a linear (1− γe)-constacyclic code over a finite chain ring is a distance-invariant quasi-cyclic co...
متن کاملAdditive cyclic codes over finite commutative chain rings
Additive cyclic codes over Galois rings were investigated in [3]. In this paper, we investigate the same problem but over a more general ring family, finite commutative chain rings. When we focus on non-Galois finite commutative chain rings, we observe two different kinds of additivity. One of them is a natural generalization of the study in [3], whereas the other one has some unusual propertie...
متن کاملOrthogonality Matrices for Modulesover Finite Frobenius RingsandMacWilliams’ EquivalenceTheorem
MacWilliams’ equivalence theorem states that Hamming isometries between linear codes extend to monomial transformations of the ambient space. One of the most elegant proofs for this result is due to K. P. Bogart et al. (1978, Inform. and Control 37, 19–22) where the invertibility of orthogonality matrices of finite vector spaces is the key step. The present paper revisits this technique in orde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1303.1870 شماره
صفحات -
تاریخ انتشار 2013